A railroad maintenance problem solved with a cut and column generation matheuristic
نویسندگان
چکیده
منابع مشابه
A railroad maintenance problem solved with a cut and column generation matheuristic
In this paper we address a real life optimization problem, the Rail Track Inspection Scheduling Problem (RTISP). This problem consists of scheduling railway network inspection tasks. The objective is to minimize the total deadhead distance while performing all inspection tasks. Different 0-1 integer formulations for the problem are presented. A heuristic based on both Benders and Dantzig-Wolfe ...
متن کاملInventory Routing Problem solved by Heuristic based on Column Generation
We consider an application of the inventory routing problem. A fleet of vehicles is devoted to collecting a single product from geographically dispersed sites. Each site has its own accumulation rate and stock capacity. On each visit, the vehicle empties the stock. At the tactical level, the objective is to minimize the fleet size and an estimate of the distance travelled. Moreover, for practic...
متن کاملA Column Generation Model for a Scheduling Problem with Maintenance Constraints
In this paper we study an allocation and scheduling problem with maintenance constraints. It consists of two difficult sub-problems: a resource allocation sub-problem and a maintenance scheduling sub-problem. A Column Generation model is proposed to solve this problem. In order to be able to find optimal solutions for the relaxed (non integer) problem a model based on a graph with supernodes ha...
متن کاملA column generation and branch-and-cut algorithm for the channel assignment problem
Department of Electrical Engineering, École Polytechnique de Montréal, P.O. Box 6079, Station Centre-ville, Montreal (Quebec) Canada, H3C 3A7 CRC Chair on the Optimization of Communication Networks, Department of Computer Science and Operations Research, Université de Montréal, P.O. Box 6128, Station Centre-ville, Montreal (Quebec) Canada, H3C 3J7 Department of Computer Science, Université du Q...
متن کاملA Column-Generation and Branch-and-Cut Approach to the Bandwidth-Packing Problem
The telecommunications problem of assigning calls with point to point demand to a capacitated network where each call can be assigned to at most one path has been called the Bandwidth-Packing Problem. For a given network, with specified arc costs and arc capacities, one wishes to route calls (defined by a starting and ending point) through the network to maximize the profit from the calls route...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Networks
سال: 2015
ISSN: 0028-3045
DOI: 10.1002/net.21605